Planning in Partially Observable Domains with Fuzzy Epistemic States and Probabilistic Dynamics
نویسندگان
چکیده
A new translation from Partially Observable MDP into Fully Observable MDP is described here. Unlike the classical translation, the resulting problem state space is finite, making MDP solvers able to solve this simplified version of the initial partially observable problem: this approach encodes agent beliefs with fuzzy measures over states, leading to an MDP whose state space is a finite set of epistemic states. After a short description of the POMDP framework as well as notions of Possibility Theory, the translation is described in a formal manner with semantic arguments. Then actual computations of this transformation are detailed, in order to highly benefit from the factored structure of the initial POMDP in the final MDP size reduction and structure. Finally size reduction and tractability of the resulting MDP is illustrated on a simple POMDP problem.
منابع مشابه
RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains
Despite the intractability of generic optimal partially observable Markov decision process planning, there exist important problems that have highly structured models. Previous researchers have used this insight to construct more efficient algorithms for factored domains, and for domains with topological structure in the flat state dynamics model. In our work, motivated by findings from the edu...
متن کاملOn the Recognition of Abstract Markov Policies
Abstraction plays an essential role in the way the agents plan their behaviours, especially to reduce the computational complexity of planning in large domains. However, the effects of abstraction in the inverse process – plan recognition – are unclear. In this paper, we present a method for recognising the agent’s behaviour in noisy and uncertain domains, and across multiple levels of abstract...
متن کاملProbabilistic Planning with Constraint Satisfaction techniques
Our research’s aim is to explore the use of constraint satisfaction techniques in probabilistic planning. We first focus on two special cases that make different assumptions on the observability of the domain: the conformant probabilistic planning problem (CfPP), where the agent’s environment is not observable, and the contingent probabilistic planning problem (CtPP), where the environment is f...
متن کاملAgentSpeak: AgentSpeak with Probabilistic Planning
AgentSpeak is a logic-based programming language, based on the Belief-Desire-Intention (BDI) paradigm, suitable for building complex agent-based systems. To limit the computational complexity, agents in AgentSpeak rely on a plan library to reduce the planning problem to the much simpler problem of plan selection. However, such a plan library is often inadequate when an agent is situated in an u...
متن کاملAction representation and partially observable planning using epistemic logic
Planning under incomplete knowledge and partial observability is a tricky issue in AI, because of its computational (temporal and spatial) hardness. Partially observable Markov decision processes (POMDP) are the mainstream approach to partially observable planning. Nevertheless, the applicability of the POMDP approach is limited from the practical side as soon as the set of states has a strong ...
متن کامل